A Study on Cutting State Observation using Mahalanobis Distance.

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unsupervised Phoneme Segmentation Using Mahalanobis Distance

Abstract One of the fundamental problems in speech engineering is phoneme segmentation. Approaches to phoneme segmentation can be divided into two categories: supervised and unsupervised segmentation. The approach of this paper belongs to the 2nd category, which tries to perform phonetic segmentation without using any prior knowledge on linguistic contents and acoustic models. In an earlier wor...

متن کامل

Anomaly detection for IGBTs using Mahalanobis distance

In this study, a Mahalanobis distance (MD)-based anomaly detection approach has been evaluated for non-punch through (NPT) and trench field stop (FS) insulated gate bipolar transistors (IGBTs). The IGBTs were subjected to electrical–thermal stress under a resistive load until their failure. Monitored on-state collector–emitter voltage and collector–emitter currents were used as input parameters...

متن کامل

Outdoor Path Labeling Using Polynomial Mahalanobis Distance

Autonomous robot navigation in outdoor environments remains a challenging and unsolved problem. A key issue is our ability to identify safe or navigable paths far enough ahead of the robot to allow smooth trajectories at acceptable speeds. Colour or texture-based labeling of safe path regions in image sequences is one way to achieve this far field prediction. A challenge for classifiers identif...

متن کامل

On Kernelizing Mahalanobis Distance Learning Algorithms

This paper focuses on the problem of kernelizing an existing supervised Mahalanobis distance learner. The following features are included in the paper. Firstly, three popular learners, namely, “neighborhood component analysis”, “large margin nearest neighbors” and “discriminant neighborhood embedding”, which do not have kernel versions are kernelized in order to improve their classification per...

متن کامل

Normalized Clustering Algorithm Based on Mahalanobis Distance

FCM (fuzzy c-means algorithm) based on Euclidean distance function converges to a local minimum of the objective function, which can only be used to detect spherical structural clusters. The added fuzzy covariance matrices in their distance measure were not directly derived from the objective function. In this paper, an improved Normalized Clustering Algorithm Based on Mahalanobis distance by t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Japan Society for Precision Engineering

سال: 1999

ISSN: 1882-675X,0912-0289

DOI: 10.2493/jjspe.65.1325